Graph Searching and Related Problems
نویسندگان
چکیده
Suppose that there is a robber hiding on vertices or along edges of a graph or digraph. Graph searching is concerned with finding the minimum number of searchers required to capture the robber. We survey the major results of graph searching problems, focusing on algorithmic, structural, and probabilistic aspects of the field.
منابع مشابه
An annotated bibliography on guaranteed graph searching
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In this annotated bibliography, we give an elementary classification of problems and results related to graph searching and provide a source of bibliographical references on this field.
متن کاملDigraph Decompositions and Monotonicity in Digraph Searching
We consider monotonicity problems for graph searching games. Variants of these games – defined by the type of moves allowed for the players – have been found to be closely connected to graph decompositions and associated width measures such as pathor tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the cops can catch a robber without ever allowin...
متن کاملGraph Searching on Chordal Graphs
In the graph searching problem initially a graph with all edges contaminated is pre sented We would like to obtain a state of the graph in which all edges are simultaneously clear by a sequence of moves using searchers The objective is to achieve the desired state by using the least number of searchers Two variations of the graph searching problem are considered in this paper One is the edge se...
متن کاملGraph searching , elimination trees , and
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a generalization of bandwidth to partially ordered layouts. We consider this generalization from two main viewpoints: graph searching and tree decompositions. The three graph parameters pathwidth, profile and bandwidth related to linear layouts can be defined by variants of g...
متن کاملConnected and Internal Graph Searching
This paper is concerned with the graph searching game. The search number s(G) of a graph G is the smallest number of searchers required to “clear” G. A search strategy is monotone (m) if no recontamination ever occurs. It is connected (c) if the set of clear edges always forms a connected subgraph. It is internal (i) if the removal of searchers is not allowed. The difficulty of the “connected” ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011